Modularising Verification Of Durable Opacity

نویسندگان

چکیده

Non-volatile memory (NVM), also known as persistent memory, is an emerging paradigm for that preserves its contents even after power loss. NVM widely expected to become ubiquitous, and hardware architectures are already providing support programming. This has stimulated interest in the design of novel concepts ensuring correctness concurrent programming abstractions face persistency development associated verification approaches. Software transactional (STM) a key abstraction supports access shared state. In fashion similar linearizability condition data structures, there established notion STMs opacity. We have recently proposed durable opacity natural extension setting with non-volatile memory. Together this condition, we designed technique based on refinement. paper, extend work two directions. First, develop durably opaque version NOrec (no ownership records), existing STM algorithm proven be opaque. Second, modularise our approach by separating proof durability accesses from For NOrec, allows us re-use complement it

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modularising Opacity Verification for Hybrid Transactional Memory

Transactional memory (TM) manages thread synchronisation to provide an illusion of atomicity for arbitrary blocks of code. There are various implementations of TM, including hardware (HTM) and software (STM). HTMs provide high performance, but are inherently limited by hardware restrictions; STMs avoid these limitations but suffer from unpredictable performance. To solve these problems, hybrid ...

متن کامل

Verification of Infinite-Step Opacity and Analysis of its Complexity ⋆

In this paper, we formulate, analyze, and devise methodologies to verify the notion of infinite-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. Specifically, a system is infinitestep opaque if the entrance of the system state at any particular instant to a set of secret states remains opaque (...

متن کامل

Verification of Opacity and Diagnosability for Pushdown Systems

In control theory of discrete event systems (DESs), one of the challenging topics is the extension of theory of finite-state DESs to that of infinite-state DESs. In this paper, we discuss verification of opacity and diagnosability for infinite-state DESs modeled by pushdown automata (called here pushdown systems). First, we discuss opacity of pushdown systems and prove that opacity of pushdown ...

متن کامل

OCL: Modularising the Language

The Object Constraint Language (OCL) was originally designed as an ‘add-on’ to the Unified Modelling Language (UML) in order to facilitate writing textual constraints complementing the graphical specifications. Since its original standardisation many extensions have been added to the language and many more have been proposed. The original structure of the OCL definition has not been formed, how...

متن کامل

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2022

ISSN: ['1860-5974']

DOI: https://doi.org/10.46298/lmcs-18(3:7)2022